Reeb graph

In Morse theory, a branch of mathematics, a Reeb graph of a scalar function describes the connectivity of its level sets.[1]Reeb graphs are named after Georges Reeb.

If the function is defined over a vector space rather than over a more general manifold, the Reeb graph forms a polytree (a directed graph formed by assigning orientations to the edges of an undirected forest). In this special case, it is also called a contour tree.[2]

Reeb graphs and contour trees have a wide variety of applications including computer aided geometric design, topology-based shape matching [3], topological simplification and cleaning, surface segmentation and parametrization, and efficient computation of level sets.

References

  1. ^ http://eprints.iisc.ernet.in/20737/ Efficient algorithms for computing Reeb graphs, Harish Doraiswamy , Vijay Natarajanb, Computational Geometry 42 (2009) 606–616
  2. ^ Carr, Hamish; Snoeyink, Jack; Axen, Ulrike (2000), "Computing contour trees in all dimensions", Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 918–926, http://portal.acm.org/citation.cfm?id=338659 .
  3. ^ Tung, Tony; Schmitt, Francis (2005). "The Augmented Multiresolution Reeb Graph Approach for Content-Based Retrieval of 3D Shapes". International Journal of Shape Modeling (IJSM) 11 (1): 91–120. http://sites.google.com/site/tony2ng/home/amrg.